Embedding functionally described abstract data types into MODULA-2 programs
Identifieur interne : 00DD72 ( Main/Exploration ); précédent : 00DD71; suivant : 00DD73Embedding functionally described abstract data types into MODULA-2 programs
Auteurs : Herbert Klaeren [Allemagne]Source :
- Microprocessors and Microsystems [ 0141-9331 ] ; 1990.
English descriptors
- Teeft :
- Abstract data types, Adts, Algebraic, Algebraic specification, Algebraic specifications, Closer inspection, Computation rules, Computer science, Data types, Definition module, Dialogue program, Early phase, Efficiency concerns, Efficient iterative code, Equivalence classes, Excellent example, Free algebra, Functional languages, Functional style, Generic, Generic list module, Generic types, Imperative languages, Imperative parts, Joker type, Klaeren, Last section, List list, Maximum advantage, Module, Operations clause, Other hand, Other words, Polymorphic types, Practical application, Program proofs, Programming languages, Recursive, Recursive definitions, Rwth aachen, Same time, Second argument, Sigplan notices, Specification, Specification language, Springer verlag, System module system, Test terms, Wiener.
Abstract
Abstract: In an early phase of system development, a system is broken up into several modules with well-defined interfaces. Some of these modules will be abstract data types (ADTs); these can be defined in a functional style. Other modules will usually be of a non-functional nature. The paper discusses the implementation of ADTs in MODULA-2 and shows that it is more promising to directly compile constructive functional ADT specifications into machine code linkable with MODULA-2 modules. A special technique guarantees that the recursive definitions used in the ADT specification are generally translated into efficient iterative code.
Url:
DOI: 10.1016/0141-9331(90)90067-6
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001320
- to stream Istex, to step Curation: 001303
- to stream Istex, to step Checkpoint: 003178
- to stream Main, to step Merge: 00E652
- to stream Main, to step Curation: 00DD72
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Embedding functionally described abstract data types into MODULA-2 programs</title><author><name sortKey="Klaeren, Herbert" sort="Klaeren, Herbert" uniqKey="Klaeren H" first="Herbert" last="Klaeren">Herbert Klaeren</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:522DA7270E6D992AC9135FFA0542516F8BB94DE2</idno><date when="1990" year="1990">1990</date><idno type="doi">10.1016/0141-9331(90)90067-6</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-GT0V1V0S-B/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001320</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001320</idno><idno type="wicri:Area/Istex/Curation">001303</idno><idno type="wicri:Area/Istex/Checkpoint">003178</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003178</idno><idno type="wicri:doubleKey">0141-9331:1990:Klaeren H:embedding:functionally:described</idno><idno type="wicri:Area/Main/Merge">00E652</idno><idno type="wicri:Area/Main/Curation">00DD72</idno><idno type="wicri:Area/Main/Exploration">00DD72</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Embedding functionally described abstract data types into MODULA-2 programs</title><author><name sortKey="Klaeren, Herbert" sort="Klaeren, Herbert" uniqKey="Klaeren H" first="Herbert" last="Klaeren">Herbert Klaeren</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Wilhelm-Schickard-Institut, Universität Tübingen, Auf der Morgenstelle 10, D-7400 Tübingen</wicri:regionArea><placeName><region type="land" nuts="1">Bade-Wurtemberg</region><region type="district" nuts="2">District de Tübingen</region><settlement type="city">Tübingen</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Microprocessors and Microsystems</title><title level="j" type="abbrev">MICPRO</title><idno type="ISSN">0141-9331</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1990">1990</date><biblScope unit="volume">14</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="161">161</biblScope><biblScope unit="page" to="166">166</biblScope></imprint><idno type="ISSN">0141-9331</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0141-9331</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Abstract data types</term><term>Adts</term><term>Algebraic</term><term>Algebraic specification</term><term>Algebraic specifications</term><term>Closer inspection</term><term>Computation rules</term><term>Computer science</term><term>Data types</term><term>Definition module</term><term>Dialogue program</term><term>Early phase</term><term>Efficiency concerns</term><term>Efficient iterative code</term><term>Equivalence classes</term><term>Excellent example</term><term>Free algebra</term><term>Functional languages</term><term>Functional style</term><term>Generic</term><term>Generic list module</term><term>Generic types</term><term>Imperative languages</term><term>Imperative parts</term><term>Joker type</term><term>Klaeren</term><term>Last section</term><term>List list</term><term>Maximum advantage</term><term>Module</term><term>Operations clause</term><term>Other hand</term><term>Other words</term><term>Polymorphic types</term><term>Practical application</term><term>Program proofs</term><term>Programming languages</term><term>Recursive</term><term>Recursive definitions</term><term>Rwth aachen</term><term>Same time</term><term>Second argument</term><term>Sigplan notices</term><term>Specification</term><term>Specification language</term><term>Springer verlag</term><term>System module system</term><term>Test terms</term><term>Wiener</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In an early phase of system development, a system is broken up into several modules with well-defined interfaces. Some of these modules will be abstract data types (ADTs); these can be defined in a functional style. Other modules will usually be of a non-functional nature. The paper discusses the implementation of ADTs in MODULA-2 and shows that it is more promising to directly compile constructive functional ADT specifications into machine code linkable with MODULA-2 modules. A special technique guarantees that the recursive definitions used in the ADT specification are generally translated into efficient iterative code.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Bade-Wurtemberg</li><li>District de Tübingen</li></region><settlement><li>Tübingen</li></settlement></list><tree><country name="Allemagne"><region name="Bade-Wurtemberg"><name sortKey="Klaeren, Herbert" sort="Klaeren, Herbert" uniqKey="Klaeren H" first="Herbert" last="Klaeren">Herbert Klaeren</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00DD72 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00DD72 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:522DA7270E6D992AC9135FFA0542516F8BB94DE2
|texte= Embedding functionally described abstract data types into MODULA-2 programs
}}
| This area was generated with Dilib version V0.6.33. |  |